Least Squares Approximation

ثبت نشده
چکیده

In many applications we want to find an approximation for a function, for example for differential equations. Example problem: We want to understand how a calculator or computer can evaluate sinx for a given value x. The processor can essentially only perform addition, multiplication, division. Therefore we can try to approximate the function with a polynomial. We use the notation Pn for polynomials of degree≤ n: Pn = { c0 + c1x+ · · ·+ cnx | c j ∈ R }

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical solution of the spread of infectious diseases mathematical model based on shifted Bernstein polynomials

The Volterra delay integral equations have numerous applications in various branches of science, including biology, ecology, physics and modeling of engineering and natural sciences. In many cases, it is difficult to obtain analytical solutions of these equations. So, numerical methods as an efficient approximation method for solving Volterra delay integral equations are of interest to many res...

متن کامل

A meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation

In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...

متن کامل

Optimal Pareto Parametric Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method

Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...

متن کامل

A New Technique for Image Zooming Based on the Moving Least Squares

In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...

متن کامل

New Approach for Approximation of Dispersivity in Porous Media

This paper presents a simple yet powerful original approach for approximating dispersivity in porous media. The key to this approach is both use of least-squares criterion and image processing technique. Two dimensional transparent models, including horizontal and vertical configurations, under different combinations of grain sizes and pore velocities, experimented. Concentration data were obta...

متن کامل

A Comparative Study of Least-Squares and the Weak-Form Galerkin Finite Element Models for the Nonlinear Analysis of Timoshenko Beams

In this paper, a comparison of weak-form Galerkin and least-squares finite element models of Timoshenko beam theory with the von Kármán strains is presented. Computational characteristics of the two models and the influence of the polynomial orders used on the relative accuracies of the two models are discussed. The degree of approximation functions used varied from linear to the 5th order. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016